A Survey of Connected Dominating Set Algorithms for Virtual Backbone Construction in Ad Hoc Networks

نویسندگان

  • P. S. Vinayagam
  • Y. Xiao
  • F. H. Li
  • L. T. Yang
  • A. B. Waluyo
  • J. Ma
  • L. Tan
چکیده

Ad hoc networks lack pre-designated routers and physical infrastructure, which makes routing in these networks a challenging task. To overcome the problems associated with this, virtual backbone has been proposed as the routing infrastructure of ad hoc networks. A well-known and well researched approach for constructing virtual backbone is Connected Dominating Set (CDS). It overcomes the broadcast storm problem and facilitates routing. In this paper, the focus is on the various CDS construction algorithms that have been put forth in the literature. A comparison of the major works relating to CDS construction is provided, emphasizing the type of algorithm, technique employed, performance metric used and the outcome achieved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Connected Dominating Set Problem in Unit Disk Graphs by Genetic Algorithms

In this paper, we use Genetic Algorithms to find the Minimum Connected Dominating Set (MCDS) of Unit Disk Graphs (UDG). UDGs are used for modeling ad-hoc networks and finding MCDS in such graphs is a promising approach to construct an efficient virtual backbone in wireless ad-hoc networks. The MCDS problem is proved to be NP-complete. The simulation results show that the proposed algorithm outp...

متن کامل

Distributed Construction of Weakly Connected Dominating Sets for Clustering Mobile Ad Hoc Networks

Weakly connected dominating set (WCDS) has been proposed to cluster mobile ad hoc networks and be used as a virtual backbone. There have been some distributed approximation algorithms proposed in the literature for minimum WCDS. But none of them have constant approximation factors. Thus these algorithms can not guarantee to generate a WCDS of small size. Their message complexities may also be a...

متن کامل

On the Scope of Backbone Formation in Wireless Ad Hoc Networks ¬リニ

Message efficiency is a prime concern in wireless computing because the nodes are resource constrained, failure prone, and sometimes mobile too. Over the years, the backbone construction has emerged as a powerful approach to achieve message efficiency and handle mobility in ad hoc wireless networks. In the existing literature, most popular techniques for virtual backbone formation are connected...

متن کامل

Virtual backbone construction in multihop ad hoc wireless networks

Recent research points out that the flooding mechanism for topology update or route request in existing ad hoc routing protocols greatly degrades the network capacity. If we restrict the broadcast of control packets within a small subset of hosts in the network, the protocol overhead can be substantially reduced. This motivates our research of constructing a virtual backbone by computing a conn...

متن کامل

On constructing k-connected k-dominating set in wireless ad hoc and sensor networks

An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Previous work in this area has focused on selecting a small virtual backbone for high efficiency. In this paper, we propose the construction of a k-connected k-dominating set (k-CDS) as a backbone to balance efficiency and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016